package com.example.leetcode;

/**
 * @description: TODO
 * @author: Sarah
 * @modified By: Sarah
 * @date: Created in 2021/8/4 17:24
 * @version:v1.0
 */
public class l123 {


    public static void main(String[] args) {

    }


    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode head;
        if (l1.val > l2.val) {
            head = l2;
            l2=l1;
            l1=head;
        }
        head = l1;

        while(l2!=null){
            if(l2.val>l1.val){

            }
        }



        return head;

    }


}

class ListNode {

    int val;
    ListNode next;

    ListNode() {
    }

    ListNode(int val) {
        this.val = val;
    }

    ListNode(int val, ListNode next) {
        this.val = val;
        this.next = next;
    }
